Automata Based Interfaces for Control and Scheduling
نویسندگان
چکیده
We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that this approach is more flexible than the classical real-time scheduling framework based on periodic tasks, and allows composition of interfaces by language-theoretic operations. We show that finite automata over infinite words offer analyzable representation and can capture many interesting interface specifications such as exponential stability of switched linear systems. Disciplines Computer Sciences Comments From the 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/503 Automata Based Interfaces for Control and Scheduling Gera Weiss and Rajeev Alur University of Pennsylvania {gera,alur}@seas.upenn.edu Abstract. We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that this approach is more flexible than the classical real-time scheduling framework based on periodic tasks, and allows composition of interfaces by language-theoretic operations. We show that finite automata over infinite words offer analyzable representation and can capture many interesting interface specifications such as exponential stability of switched linear systems. We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that this approach is more flexible than the classical real-time scheduling framework based on periodic tasks, and allows composition of interfaces by language-theoretic operations. We show that finite automata over infinite words offer analyzable representation and can capture many interesting interface specifications such as exponential stability of switched linear systems.
منابع مشابه
Optimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملA Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007